Further Results on Asymmetric Authentication Schemes

This paper derives some further results on unconditionally secure asym-metric authentication schemes. It starts by giving a general framework for constructing A 2-codes, identifying many known constructions as special cases. Then a full treatment of A 3-codes (A 2-codes protecting against arbiter's attacks) is given, including bounds on the parameters and optimal constructions. With these models as a basis, we proceed by giving constructions of general asymmetric authentication schemes, i.e., schemes protecting against speciied arbitrary sets of participants collaborating in order to cheat someone else. As a consequence, we improve upon Chaum and Roijakkers interactive construction of unconditionally secure digital signatures Chaum and Roijakkers 1990], and present a (non-interactive) construction in the form of a code. In addition, we also show a few bounds for this general model, proving the optimality of some constructions.